From combinatorial optimization to real algebraic geometry and back
نویسندگان
چکیده
منابع مشابه
From combinatorial optimization to real algebraic geometry and back
In this paper, we explain the relations between combinatorial optimization and real algebraic geometry with a special focus to the quadratic assignment problem. We demonstrate how to write a quadratic optimization problem over discrete feasible set as a linear optimization problem over the cone of completely positive matrices. The latter formulation enables a hierarchy of approximations which r...
متن کاملNon-Convex Optimization via Real Algebraic Geometry
The high level purpose of this paper is to describe some recent advances in the field of Mathematics called Real Algebraic Geometry, and discuss some of its applications to complexity theory, and non-convex optimization. In particular, one of the questions underlying the entire development, is the crucial question: What makes an optimization problem difficult or easy? Along the way, we try to p...
متن کاملReal Algebraic Geometry in Convex Optimization
Real Algebraic Geometry in Convex Optimization
متن کاملCombinatorial optimization in geometry
In this paper we extend and unify the results of [20] and [19]. As a consequence, the results of [20] are generalized from the framework of ideal polyhedra in H to that of singular Euclidean structures on surfaces, possibly with an infinite number of singularities (by contrast, the results of [20] can be viewed as applying to the case of non-singular structures on the disk, with a finite number...
متن کاملNumerical Real Algebraic Geometry
Sottile’s lectures from the Oberwolfach Seminar “New trends in algorithms for real algebraic geometry”, November 23–28, 2009.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Croatian Operational Research Review
سال: 2014
ISSN: 1848-0225,1848-9931
DOI: 10.17535/crorr.2014.0001